Universitat Passau Fakult at F Ur Mathematik Und Informatik P Constant Propagation in Explicitly Parallel Programs 1
نویسنده
چکیده
Constant propagation (CP) is a powerful, practically relevant optimization of sequential programs. However, only few approaches have been proposed aiming at making CP available for parallel programs. In fact, because of the computational complexity paraphrased by the catch-phrase \state explosion problem," the successful transfer of sequential techniques is currently essentially restricted to bitvector-based optimizations. Because of their structural simplicity they can be enhanced to parallel programs at almost no costs on the implementation and computation side. CP, however, is beyond this class. Here, however, we present a powerful algorithm for constant propagation in parallel programs, which is based on an extension of the framework underlying the successful transfer of bitvector problems, and which can be implemented as easily and as e ciently as its sequential counterpart for simple constants computed by state-of-the-art sequential optimizers.
منابع مشابه
Universitat Passau Fakult at F Ur Mathematik Und Informatik P Eliminating Partially Dead Code in Explicitly Parallel Programs 1
Eliminating partially dead code has proved to be a powerful technique for the runtime optimization of sequential programs. In this article, we show how this technique can be adapted to explicitly parallel programs with shared memory and interleaving semantics on the basis of a recently presented framework for e cient and precise bitvector analyses for this program setting. Whereas the framework...
متن کاملUniversitat Passau Fakult at F Ur Mathematik Und Informatik P Module Connguration by Minimal Model Construction
We present a framework for the automatic con guration of large systems from a library of reusable software components. Core of the framework is a modal logic that uniformly and elegantly captures type descriptions, module speci cations and relative time. Whereas the rst two `dimensions' are treated similarly by means of a simple logic over a taxonomy of types and modules respectively, time is e...
متن کاملUniversitat Passau Fakult at F Ur Mathematik Und Informatik P Chaotic Fixed Point Iterations
In this paper we present a new xed point theorem applicable for a countable system of recursive equations over a wellfounded domain. Wellfoundedness is an essential feature of many computer science applications as it guarantees termination of the corresponding xed point computation algorithms. Besides being a natural restriction, it marks a new area of application, where not even monotonicity i...
متن کاملAbstraction and Performance in the Design of Parallel Programs Der Fakultt at F Ur Mathematik Und Informatik Der Universitt at Passau Vorgelegte Zusammenfassung Der Verr Ooentlichungen Zur Erlangung Der Venia Legendi
متن کامل
Universitat Passau Fakult at Ff Ur Mathematik Und Informatik P Chaotic Fixed Point Iterations
In this paper we present a new xed point theorem applicable for a countable system of recursive equations over a wellfounded domain. Wellfoundedness is an essential feature of many computer science applications as it guarantees termination of the corresponding xed point computation algorithms. Besides being a natural restriction, it marks a new area of application, where not even monotonicity i...
متن کامل